Decompositions of Complete Graphs into Factors with Diameter Two
نویسنده
چکیده
In the present paper the question is studied from three points of vieAv whether to any natural number k _> 2 there exists a complete graph decomposable into k factors with diameters two . The affirmative answer to this question is given and some estimations for the minimal possible number of vertices of such a complete graph are deduced . As a corollary it follows that given k diameters di, d2 , . . ., dk (where k 3 3 and di > 2 for i = 1, 2, 3, . . . , k) ,. there always exists a finite complete graph decomposable into k factors with diameters di , d2, . . . , dk . Thus Problem I from [I] is solved .
منابع مشابه
Decompositions of complete multipartite graphs into selfcomplementary factors with finite diameters
For r 4 we determine the smallest number of vertices, .<71-( d), of complete that are decomposable into two isomorphic factors for a given finite diameter d. We also prove that for a ,d such graph exists for each order than gr( d). 1. INTRODUCTORY NOTES AND DEFINITIONS In this paper we study decompositions of finite complete multipartite graphs factors with prescribed diameter. A factor F of a ...
متن کاملTransitive decompositions of graphs
A decomposition of a graph is a partition of the edge set. One can also look at partitions of the arc set but in this talk we restrict our attention to edges. If each part of the decomposition is a spanning subgraph then we call the decomposition a factorisation and the parts are called factors. Decompositions are especially interesting when the subgraphs induced by each part are pairwise isomo...
متن کاملSimplicial tree-decompositions of infinite graphs, I
This paper is intended as an introduction to the theory of simplicial decompositions of graphs. It presents, in a unified way, new results as well as some basic old ones (with new proofs). Its main result is a structure theorem for infinite graphs with a simplicial tree-decomposition into primes. The existence and uniqueness of such prime decompositions will be investigated in two subsequent pa...
متن کاملFactorizations of the complete graphs into factor of subdiameter two and factors of diameter three
We search for the minimal number of vertices of the complete graph that can be decomposed into one factor of subdiameter 2 and k factors of diameter 3. We find as follows: exact values for k ≤ 3, upper and lower bounds for small values of k and lim k→∞ φ (k) k = 2.
متن کاملBi-cyclic decompositions of complete graphs into spanning trees
We examine decompositions of complete graphs with an even number of vertices, K2n, into n isomorphic spanning trees. While methods of such decompositions into symmetric trees have been known, we develop here a more general method based on a new type of vertex labelling, called flexible q-labelling. This labelling is a generalization of labellings introduced by Rosa and Eldergill.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004